Computation of Molecular Spectra on a Quantum Processor with an Error-Resilient Algorithm
نویسندگان
چکیده
منابع مشابه
Computation of Molecular Spectra on a Quantum Processor with an Error-Resilient Algorithm
Harnessing the full power of nascent quantum processors requires the efficient management of a limited number of quantum bits with finite coherent lifetimes. Hybrid algorithms, such as the variational quantum eigensolver (VQE), leverage classical resources to reduce the required number of quantum gates. Experimental demonstrations of VQE have resulted in calculation of Hamiltonian ground states...
متن کاملResilient Quantum Computation: Error Models and Thresholds
Recent research has demonstrated that quantum computers can solve certain types of problems substantially faster than the known classical algorithms. These problems include factoring integers and certain physics simulations. Practical quantum computation requires overcoming the problems of environmental noise and operational errors, problems which appear to be much more severe than in classical...
متن کاملError-resilient Dna Computation Ecole Normale Supérieure De Lyon Error-resilient Dna Computation Error-resilient Dna Computation
The DNA model of computation with test tubes of DNA molecules encoding bit sequences is based on three primitives Extract A Bit Merge Two Tubes and Detect Emptiness Perfect operations can test the satis ability of any boolean formula in linear time However in re ality the Extract operation is faulty We determine the minimum num ber of faulty Extract operations required to simulate a single high...
متن کاملResilient Quantum Computation
The discovery that quantum computers can be much more powerful than their classical counterparts (1–4) and recent advances in quantum device technology (5, 6) have brought the field of quantum computation into the limelight. However, until recently, the hope of taming quantum systems has been overshadowed by the fragility of quantum information. This fragility comes from two seemingly contradic...
متن کاملAn Error-Resilient Blocksorting Compression Algorithm
A Burrows-Wheeler Compressor breaks input into blocks, quickly makes each more compressible, and compresses the modified block with a simple arithmetic or Huffman compressor. We propose an error-resilient Inverse Burrows-Wheeler Compressor. It uses a small amount of overhead alongside output from an ordinary BWT and MTF. It is also size-competitive with BZIP, a popular Burrows-Wheeler compressor.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review X
سال: 2018
ISSN: 2160-3308
DOI: 10.1103/physrevx.8.011021